Reliable Liner Shipping Hub Location Problem Considering Hub Failure

نویسندگان

چکیده

Hub ports play an important role in reducing the number of container routes and saving operating costs liner companies. However, hub failures caused by uncertainties such as natural disasters may cause huge recovery costs. Considering accidental failure probability reallocation feeder ports, a global reliable shipping location problem (RLSHLP) is studied. We use k-means algorithm to divide network into different communities propose two mixed integer linear programs determine port each community. Then Benders decomposition applied RLSHLP compared with our method. Numerical experiments verify effectiveness method optimal scheme considering failure.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable single allocation hub location problem under hub breakdowns

The design of hub-and-spoke transport networks is a strategic planning problem, as the choice of hub locations has to remain unchanged for long time periods. However, strikes, disasters or traffic breakdown can lead to the unavailability of a hub for a short period of time. Therefore it is important to consider such events already in the planning phase, so that a proper reaction is possible; on...

متن کامل

A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities

In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...

متن کامل

Hub Covering Location Problem Considering Queuing and Capacity Constraints

In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...

متن کامل

Multimodal hub location and hub network design

Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In hub network design problem, we jointly consider transportation costs and travel times, which are studied separately in most hub location problems presented in the literature. We allow different trans...

متن کامل

Solving Hub Location Problem with Genetic Algorithm

In this paper, we present an effective solution using the genetic algorithm for the uncapacitated single allocation hub location problem (USAHLP). This solution was published before, but today it still gives the really effective results, although there are many studies have been done after it. We also make an application using this method and present the performance results of this method.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Marine Science and Engineering

سال: 2023

ISSN: ['2077-1312']

DOI: https://doi.org/10.3390/jmse11040818